FLA by Lalit Vashishtha

0:10:36

Regular Expressions 1

0:18:40

DFA for union, intersection, difference and complimentation of two dfas

0:06:51

Formal definition of DFA

0:11:37

Formal Languages & Automata Theory

0:11:04

Finite Automata to Regular Expression 3

0:08:47

DFA for the strings ending with b and of the form a^n b

0:04:21

DFA for length of string should be divisible by 3 but length should not be 6

0:13:44

Finite Automata to Regular Expression conversion 1

0:09:11

DFA for strings starting and ending with same symbol, with different symbols, with a and b

0:06:04

Formal definition of NFA with examples

0:06:44

DFA for complementing the DFA

0:11:27

DFA for strings with exactly 1a, atleast 1a, no more than 3a's, at least 1a and exactly 2b's

0:22:47

Mid Sem Exam Solution Q5

0:08:01

Lembda NFA to NFA Conversion

0:06:21

Regular Expression to DFA

0:15:13

Non Deterministic Push Down Automata

0:09:05

DFA for the strings having legth divisible by 2 and 3 and their cases

0:04:57

NFA for a^nb^n where n lies in [0,5] and n is an integer

0:06:20

DFA for Concatenation of two Languages

0:05:13

DFA for the strings having no of a's 2, greater than or equal to 2, less than or equal to 2, , less

0:04:31

NFA to DFA conversion 2

0:13:09

Push Down Automata for a context free language2

0:07:10

NFA to DFA Conversion 9

0:07:59

DFA for a^mb^n where m+n is odd